Refutation of Sallé's Longstanding Conjecture

نویسندگان

  • Benedetto Intrigila
  • Giulio Manzonetto
  • Andrew Polonsky
چکیده

The ⁄-calculus possesses a strong notion of extensionality, called “the Ê-rule”, which has been the subject of many investigations. It is a longstanding open problem whether the equivalence obtained by closing the theory of Böhm trees under the Ê-rule is strictly included in Morris’s original observational theory, as conjectured by Sallé in the seventies. In a recent work, Breuvart et al. have shown that Morris’s theory satisfies the Ê-rule. In this paper we demonstrate that the two aforementioned theories actually coincide, thus disproving Sallé’s conjecture. 1998 ACM Subject Classification F.4.1 Mathematical Logic

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture

The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between B\"ohm trees. It is well known that the lambda-theory H*, arising by taking as observables the head normal forms, equates two lambda-terms whenever their B\"ohm trees are equal up to countably many possibly infinite eta-expansions. Similarly, two lambda-terms are...

متن کامل

On Refutation of Random Constraint Satisfaction Problems

Given a k-ary predicate P , a random instance of a constraint satisfaction problem (CSP) is a set of m constraints on n variables. Each constraint is P applied to k random literals. Such an instance is unsatisfiable with high probability when m n. Although this fact can be proven via a simple probabilistic argument, certifying that a given randomly chosen instance is unsatisfiable, a task calle...

متن کامل

Clausal Representations of Markov Networks and Related Probabilistic Models

Connections between Muggleton's stochastic logic programs (SLPs) and (undirected) Bayesian nets are explored. Logical variables map to random variables, predicates map to joint distributions and Markov net structure maps to clausal structure. Naive methods for answering proba-bilistic queries using SLPs are given, as well as some suggestions for non-naive approaches. Multi-clause SLPs deene mix...

متن کامل

A Proof on Seifert's Conjecture in R

In this article, we prove that there exists at least one periodic orbit of Hamilton vector field on a given energy hypersurface in R 2n which proves the longstanding Seifert's conjecture.

متن کامل

A resolution lower bound for a principle capturing the hardness of depth-1 LK

We introduce principles 2VR and 2VR which imply reflection for, respectively, the CNFs and the narrow CNFs refutable in the depth-1 propositional LK system PK1. We give a polynomial-size refutation of their negations 2VR and 2VR in the system PK1 and show an exponential lower bound on the size of their resolution refutations. We conjecture that they have no small Res(log) refutations; this woul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017